Fast Point-to-Point Shortest Path Computations with Arc-Flags
نویسندگان
چکیده
We present a number of improvements of the basic variant of the arc-flag acceleration (Lauther, 1997, 2004) for point-to-point (P2P) shortest path computations on large graphs. Arc-flags are a modification to the standard Dijkstra algorithm and are used to avoid exploring unnecessary paths during shortest path computation. We assume that for the same input graph the shortest path problem has to be solved repeatedly for different node pairs. Thus, precomputing the arc-flags is possible. We show that the improved arc-flag acceleration achieves speedups of P2P shortest path queries of more than 1,470 on a subnetwork of the German road network with 1M node and 2.5M arcs using 450 bits of additional information per arc. The acceleration factors increase with the size of the input graph. Finally, we present an improved preprocessing version which allows precomputing arc-flags for European and North-American road networks within hours.
منابع مشابه
An Experimental Evaluation of Point-To-Point Shortest Path Calculation on Road Networks with Precalculated Edge-Flags
We present an efficient algorithm for fast and exact calculation of shortest paths in graphs with geometrical information in nodes (coordinates), e.g. road networks. The method is based on preprocessing and therefore best suited for static graphs, i.e., graphs with fixed topology and edge costs. In the preprocessing phase, the network is divided into regions and edge flags are calculated that i...
متن کاملAcceleration of Shortest Path and Constrained Shortest Path Computation
We study acceleration methods for point-to-point shortest path and constrained shortest path computations in directed graphs, in particular in road and railroad networks. Our acceleration methods are allowed to use a preprocessing of the network data to create auxiliary information which is then used to speed-up shortest path queries. We focus on two methods based on Dijkstra’s algorithm for sh...
متن کاملFast point-to-point shortest path queries on dynamic road networks with interval data
Consider a weighted directed graph G = (V,A, c) (where c : A → R+) which represents a road network evaluated by travelling times (so the graph may not be Euclidean). Assuming that c changes every few minutes, that the cardinality of V is very large (several million vertices), and that each shortest path request must be answered in a few milliseconds, current technology does not allow us to find...
متن کاملPoint Cloud Simplification and Processing for Path-Planning
Recently the area of motion planning research has been experiencing a significant resurgence of interest based on hybrid working environments that combine point and CAD models. Companies are able to work with point clouds and perform certain operations, such as path-planning, but they lack the support for fast shortest-distance computations for point clouds with more than tens of millions of po...
متن کاملFully Dynamic Maintenance of Arc-Flags in Road Networks
The problem of finding best routes in road networks can be solved by applying Dijkstra’s shortest paths algorithm. Unfortunately, road networks deriving from real-world applications are huge yielding unsustainable times to compute shortest paths. For this reason, great research efforts have been done to accelerate Dijkstra’s algorithm on road networks. These efforts have led to the development ...
متن کامل